#include"tool.h"
enum{N=200000001};
BOOL p[N];
void fill()
{
    int i,j;
    memset(p,1,sizeof(p));
    p[0]=p[1]=0;
    for(i=2;i*i<=N;i++)
        if(p[i])
            for(j=i*i;j<N;j+=i)
                p[j]=0;
}

BOOL f(int n)
{
    int k;
    for(k=3;k<=n/2;k+=2)
    {
       /**if(prime(k)&&prime(n-k))*/
       if(p[k]&&p[n-k])
            return TRUE;
    }
    return FALSE;
}
int main()
{
    LONG start=clock();
    fill();
    int s=6,e=N;
    int n;
    for(n=s;n<=e;n+=2)
        if(!f(n))
            puts("Goldbach is wrong!");
    LONG end=clock();
    printf("%.3f seconds\n",(end-start)/1000.0);

    return 0;
}


